In this paper, a class of two-weight and three-weight linear codes over$\gf(p)$ is constructed, and their application in secret sharing isinvestigated. Some of the linear codes obtained are optimal in the sense thatthey meet certain bounds on linear codes. These codes have applications also inauthentication codes, association schemes, and strongly regular graphs, inaddition to their applications in consumer electronics, communication and datastorage systems.
展开▼
